An Empirical Study of the Scalability of Performance Analysis Tools in the

This paper analyses the weighted fair queueing (W F Q) system subject to two classes of network applications. The ar rival traffic flows follow Poisson processes.The service times is exponentially distr ibuted. The system is modelled as a two-dimensional M arkov chain and use matrix geomet r ic technique to solve its stationary probabilities. The determination of the steady state probabilities can be used to compute the performance measures of the system, such as the mean queue length, the throughput and the mean response time. Moreover , the efficiency of the proposed methodologies had been demonstrated by the simulation results in terms of mean queue length and system throughput. K eywords-F irst Inter F irst Out ( F I F O); Markov chain; Shared buffer model, N M M M / 1 / / 1 0 ; Weighted F air Queuing (W F Q).